2-Colored triangles in edge-colored complete graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge disjoint monochromatic triangles in 2-colored graphs

Let N (n; k) be the minimum number of pairwise edge disjoint monochromatic complete graphs Kk in any 2-coloring of the edges of a Kn. Upper and lower bounds on N (n; k) will be given for k¿ 3. For k =3, exact values will be given for n6 11, and these will be used to give a lower bound for N (n; 3). c © 2001 Elsevier Science B.V. All rights reserved.

متن کامل

Properly colored Hamilton cycles in edge-colored complete graphs

It is shown that for every > 0 and n > n0( ), any complete graph K on n vertices whose edges are colored so that no vertex is incident with more than (1 − 1 √ 2 − )n edges of the same color, contains a Hamilton cycle in which adjacent edges have distinct colors. Moreover, for every k between 3 and n any such K contains a cycle of length k in which adjacent edges have distinct colors.

متن کامل

Long properly colored cycles in edge colored complete graphs

Let Kc n denote a complete graph on n vertices whose edges are colored in an arbitrary way. Let ∆mon(Kc n) denote the maximum number of edges of the same color incident with a vertex of Kn. A properly colored cycle (path) in Kc n is a cycle (path) in which adjacent edges have distinct colors. B. Bollobás and P. Erdös (1976) proposed the following conjecture: If ∆mon(Kc n) < b 2 c, then Kc n con...

متن کامل

Colored Trees in Edge-Colored Graphs

The study of problems modeled by edge-colored graphs has given rise to important developments during the last few decades. For instance, the investigation of spanning trees for graphs provide important and interesting results both from a mathematical and an algorithmic point of view (see for instance [1]). From the point of view of applicability, problems arising in molecular biology are often ...

متن کامل

Maximum colored trees in edge-colored graphs

Abstract We consider maximum properly edge-colored trees in edge-colored graphs Gc. We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree rooted at r, such that all root-to-leaf paths are properly colored. We consider these problems from graphtheoretic as well as algorithmic viewpoints. We prove their optimization versions to be NP-hard in general...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 1978

ISSN: 0095-8956

DOI: 10.1016/0095-8956(78)90056-4